Ant Colony Algorithm and Genetic Algorithm Optimization for Test Vector Reordering
نویسندگان
چکیده
منابع مشابه
An Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملGenetic Algorithm and Ant Colony Optimization
In 1993 some hybrid technics combining OFDM and code division multiple access (CDMA) were proposed [3]. One of that technics is multicarrier code division multiple access (MCCDMA) witch introduce frequency spreading and multiple access. Both, OFDM and MCCDMA, have disadvantage in high peak to average power ratio (PAPR). There are many PAPR reduction schemes are for OFDM and most of them is usef...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملAnt Colony Optimization Algorithm
Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.
متن کاملEvolutionary Algorithm Ant Colony Optimization
I Which size? Trade-off I Minimum size: connectivity by recombination is achieved if at least one instance of every allele is guaranteed to be be present at each locus. Ex: if binary: P∗ 2 = (1− (0.5) ) for l = 50, it is sufficient M = 17 to guarantee P∗ 2 > 99.9%. I Often: independent, uninformed random picking from given search space. I Attempt to cover at best the search space, eg, Latin hyp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Technology Journal
سال: 2012
ISSN: 1812-5638
DOI: 10.3923/itj.2012.1786.1789